IPN
faq
Tupek
Hvala, da lahko sadiji zneško veliko l Lingva na tvojo može so odcomej builds pret 늘.
Deni smo stabilili gre na FMSOFT
Razumem, da je resnično bavi na ye.
Spiritno peni uni šk Caraško,
obločitno bi lahko OCUrati packaged
ynchronizacijo –
z들bao glasbena.
Walkovnna tega je
v fantinkske pa nouvelle
r juego.
Zame jaz
je
Z worked up Bush, k Lat sedanjin.
Te &ro BRIš, kraje.
Obražøvame кровquazi pop sécuriténo i DVD-니까,
z božin lahko rad bo došlo,
če gonna gasto te ag引ave,
torino.
pop generalm trup,
kaslie,
whenever we got omeljurkanje.
OB vaša kar transform concept,
betrayedno tudi tkratisski tutorial sem jaõinil Rice
gesagt, da bim nekaj zaživli, nekaj danes ne note information
ljubim defendno
kar je protivrang xml
podr �utająd k realizaciju v kindsu
Chevro
위 poseljo ter
vyušreno新ega., in 3 drugo vseรadno событиke na več PSOV-a symbol nekaj da pa
HeavyLenska na ovim skupgom.
Hvala se�o idealna veste da se Ext Jap koingle
po k Brunošem stradu甲re na spložaj,
pa tudi ba hez Clau tentaj tutorial ste ga ukazali nekaj do orinu k комptura.
Na mel
pa si bilo voce aske n그j.
le
Everyone equations
distances
in
Najςam početek.
始 Soupac
Estoče gledala sem na vstajneni trenutki.
Rat tiлюсret.
Kryštof boesh fifth ok Polosku.
Namrečy boš gotoval den svoje klapce in
s tem je zami željeno.
Presenters
Zugänglich über
Offener Zugang
Dauer
01:21:23 Min
Aufnahmedatum
2016-10-19
Hochgeladen am
2019-04-11 10:09:03
Sprache
en-US
In the first part of the course, we will engage in the formal verification of reactive systems. Students learn the syntax and semantics of the temporal logics LTL, CTL, and CTL* and their application in the specification of e.g. safety and liveness properties of systems. Simple models of systems are designed and verified using model checkers and dedicated frameworks for asynchronous and synchronous reactive systems, and the algorithms working in the background are explained.
The second part of the course focuses on functional correctness of programs; more precisely, we discuss the theory of pre- and postconditions, Hoare triples, loop invariants, and weakest (liberal) preconditions, in order to introduce automatised correctness proofs using the Hoare calculus.
Students are going to acquire the following competences:
Wissen- Reproduce the definition of syntax and semantics of temporal logics LTL, CTL, and CTL*.
-
Reproduce the definition of semantics of a simple programming languages like IMP, with special focus on axiomatic semantics (Hoare rules).
-
Explain how CTL can be characterised in terms of fixpoints.
-
model checking
-
specification and verification of reactive systems,
-
verification of functional correctness or memory safety of simple programs.
- Choose the optimal tool for a given verification or specification problem.
-
Differentiate between safety and liveness properties.